منابع مشابه
Completion after Program Inversion of Injective Functions
Given a constructor term rewriting system that defines injective functions, the inversion compiler proposed by Nishida, Sakai and Sakabe generates a conditional term rewriting system that defines the inverse relations of the injective functions, and then the compiler unravels the conditional system into an unconditional term rewriting system. In general, the resulting unconditional system is no...
متن کاملBuilding Injective Trapdoor Functions From Oblivious Transfer
Injective one-way trapdoor functions are one of the most fundamental cryptographic primitives. In this work we give a novel construction of injective trapdoor functions based on oblivious transfer for long strings. Our main result is to show that any 2-message statistically sender-private semihonest oblivious transfer (OT) for strings longer than the sender randomness implies the existence of i...
متن کاملThe MacNeille Completion of the Poset of Partial Injective Functions
Abstract. Renner has defined an order on the set of partial injective functions from [n] = {1, . . . , n} to [n]. This order extends the Bruhat order on the symmetric group. The poset Pn obtained is isomorphic to a set of square matrices of size n with its natural order. We give the smallest lattice that contains Pn. This lattice is in bijection with the set of alternating matrices. These matri...
متن کاملConvergent Term Rewriting Systems for Inverse Computation of Injective Functions
This paper shows a sufficient syntactic condition for constructor TRSs whose inverse-computation CTRSs generated by Nishida, Sakai and Sakabe’s inversion compiler are confluent and operationally terminating. By replacing the unraveling at the second phase of the compiler with Serbanuta and Rosu’s transformation, we generate convergent TRSs for inverse computation of injective functions satisfyi...
متن کاملSecure key-exchange protocol with an absence of injective functions.
The security of neural cryptography is investigated. A key-exchange protocol over a public channel is studied where the parties exchanging secret messages use multilayer neural networks which are trained by their mutual output bits and synchronize to a time dependent secret key. The weights of the networks have integer values between +/-L. Recently an algorithm for an eavesdropper which could b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1974
ISSN: 0097-3165
DOI: 10.1016/0097-3165(74)90038-7